Fully-Dynamic Recognition Algorithm and Certificate for Directed Cographs
نویسندگان
چکیده
This paper presents an optimal fully-dynamic recognition algorithm for directed cographs. Given the modular decomposition tree of a directed cograph G, the algorithm supports arc and vertex modification (insertion or deletion) in O(d) time where d is the number of arcs involved in the operation. Moreover, if the modified graph remains a directed cograph, the modular tree decomposition is updated; otherwise, a certificate is returned within the same complexity.
منابع مشابه
A fully dynamic algorithm for modular decomposition and recognition of cographs
The problem of dynamically recognizing a graph property calls for e ciently decid ing if an input graph satis es the property under repeated modi cations to its set of vertices and edges The input to the problem consists of a series of modi cations to be performed on the graph The objective is to maintain a representation of the graph as long as the property holds and to detect when it ceases t...
متن کاملEfficient parallel recognition of cographs
In this paper, we establish structural properties for the class of complement reducible graphs or cographs, which enable us to describe efficient parallel algorithms for recognizing cographs and for constructing the cotree of a graph if it is a cograph; if the input graph is not a cograph, both algorithms return an induced P4. For a graph on n vertices andm edges, both our cograph recognition a...
متن کاملCharacterisations and Linear-Time Recognition of Probe Cographs
Cographs are those graphs without induced path on four vertices. A graph G is a probe cograph if its vertex set can be partitioned into two sets, N (non-probes) and P (probes) where N is independent and G can be extended to a cograph by adding edges between certain non-probes. A partitioned probe cograph is a probe cograph with a given partition in N and P . We characterise probe cographs in se...
متن کاملAdding an Edge in a Cograph
In this paper, we establish structural properties of cographs which enable us to present an algorithm which, for a cograph G and a non-edge xy (i.e., two non-adjacent vertices x and y) of G, finds the minimum number of edges that need to be added to the edge set of G such that the resulting graph is a cograph and contains the edge xy. The motivation for this problem comes from algorithms for th...
متن کاملRobot Arm Performing Writing through Speech Recognition Using Dynamic Time Warping Algorithm
This paper aims to develop a writing robot by recognizing the speech signal from the user. The robot arm constructed mainly for the disabled people who can’t perform writing on their own. Here, dynamic time warping (DTW) algorithm is used to recognize the speech signal from the user. The action performed by the robot arm in the environment is done by reducing the redundancy which frequently fac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004